Algebraic Multigrid for Moderate Order Finite Elements
نویسندگان
چکیده
The paper discusses algebraic multigrid (AMG) methods for the solution of large sparse linear systems arising from the discretization of scalar elliptic partial differential equations with Lagrangian finite elements of order at most 4. The resulting system matrices do not have the M-matrix property that is used by standard analyzes of classical AMG and aggregation-based AMG methods. A unified approach is presented that allows to extend these analysis. It uses an intermediate M-matrix and highlights the role of the spectral equivalent constant that relate this matrix to the original system matrix. This constant is shown to be bounded independently of the problem size and jumps in the coefficients of the partial differential equations that are located at elements’ boundaries. For two dimensional problems, it is further shown to be uniformly bounded if the angles in the triangulation also satisfy a uniform bound. Because the intermediate M-matrix can be computed automatically, an alternative strategy is also investigated that defines the AMG preconditioners from this matrix instead of from the original matrix. Numerical experiments are presented that asses both strategies using publicly available state-of-the-art implementations of classical AMG and aggregation-based AMG methods.
منابع مشابه
Algebraic Multigrid Preconditioning of High-Order Spectral Elements for Elliptic Problems on a Simplicial Mesh
Algebraic multigrid is investigated as a solver for linear systems that arise from high-order spectral element discretizations. An algorithm is introduced that utilizes the efficiency of low-order finite elements to precondition the high-order method in a multilevel setting. In particular, the efficacy of this approach is highlighted on simplexes in two and three dimensions with nodal spectral ...
متن کاملAlgebraic Multigrid for High-Order Hierarchical H(curl) Finite Elements
Classic multigrid methods are often not directly applicable to nonelliptic problems such as curl-type partial differential equations (PDEs). Curl-curl PDEs require specialized smoothers that are compatible with the gradient-like (near) null space. Moreover, recent developments have focused on replicating the grad-curl-div de Rham complex in a multilevel hierarchy through smoothed aggregation ba...
متن کاملThe hp-multigrid method applied to hp-adaptive refinement of triangular grids
Recently the hp version of the finite element method, in which adaptivity occurs in both the size, h, of the elements and in the order, p, of the approximating piecewise polynomials, has received increasing attention. It is desirable to combine this optimal order discretization method with an optimal order algebraic solution method, such as multigrid. An intriguing notion is to use the values o...
متن کاملA general framework for multigrid methods for mortar finite elements
In this paper, a general framework for the analysis of multigrid methods for mortar finite elements is considered. The numerical realization is based on the algebraic saddle point formulation arising from the discretization of second order elliptic equations on nonmatching grids. Suitable discrete Lagrange multipliers on the interface guarantee weak continuity and an optimal discretization sche...
متن کاملAlgebraic Multigrid by Component Splitting for Edge Elements on Simplicial Triangulations
Our focus is on Maxwell’s equations in the low frequency range; two specific applications we aim at are time-stepping schemes for eddy current computations and the stationary double-curl equation for time-harmonic fields. We assume that the computational domain is discretized by triangles or tetrahedrons; for the finite element approximation we choose Nédélec’s H( url)-conforming edge elements ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Scientific Computing
دوره 36 شماره
صفحات -
تاریخ انتشار 2014